Characteristic Evaluation of Distributed QoS Routing
نویسندگان
چکیده
In current scenario of Internet, the demand of real time multimedia applications has been increased. These applications are bandwidth greedy, impose strict delay guarantees, stable jitter and low packet loss probabilities, which require a fixed Quality-of-Service (QoS) assurance in transmission. The present Internet routing methods, based on the besteffort paradigm, is not able to provide any performance assurance required in these applications. Here is a need of the mechanism which will consider these QoS factors(delay ,jitter, bandwidth etc.) for the transmission. There are many aspects in the network which provide the guarantee of the quality of service. However the one of the key technology for providing it is the QoS routing. The basic problem of QoS routing is to find a path satisfying multiple constraints. It is focused on identifying the path that will consider multiple parameters like bandwidth, delay, jitter, cost, hop count etc. instead of one. To provide Quality of Service (QoS) guarantee both of the routing schemes –source routing and distributed routing can be used. In source routing, the path computation is done at source node whereas in distributed routing, the path computation is distributed among intermediate routers between source and destination. Both source routing and distributed routing have important roles to play in QoS routing. Source routing is seen impractical in Internet as the complete explicit path would have to be included in the IP header. In source routing, path computation is done at the source node. Whereas in distributed routing, path computation is distributed among set of intermediate nodes between source and destination. Source routing is used in today‟s Internet for special cases only, such as mapping the network with trace route, troubleshooting etc. Distributed routing is currently the dominant method in Internet. This paper describes the distributed routing approach and its implementation in QoS domain. Many distributed QoS routing algorithms have been proposed in literature by varying the QoS metrics and protocols. The paper discusses some of these algorithms and also provides their characteristics evaluation depicting its type, metrics considered and state information.
منابع مشابه
Advanced operations research techniques for multi-constraint QoS routing in internet
Internet Traffic has grown exponentially over last few years due to provision of multiple class services through Internet backbone. With the explosive use of Internet, contemporary Internet routers are susceptible to overloads and their services deteriorate drastically and often cause denial of services. In this paper, an analysis is made how forecasting technique, routing algorithm and Genetic...
متن کاملMulticast Routing in Wireless Sensor Networks: A Distributed Reinforcement Learning Approach
Wireless Sensor Networks (WSNs) are consist of independent distributed sensors with storing, processing, sensing and communication capabilities to monitor physical or environmental conditions. There are number of challenges in WSNs because of limitation of battery power, communications, computation and storage space. In the recent years, computational intelligence approaches such as evolutionar...
متن کاملEvolutionary Computing Assisted Wireless Sensor Network Mining for QoS-Centric and Energy-efficient Routing Protocol
The exponential rise in wireless communication demands and allied applications have revitalized academia-industries to develop more efficient routing protocols. Wireless Sensor Network (WSN) being battery operated network, it often undergoes node death-causing pre-ma...
متن کاملA distributed cache architecture with snooping for QoS routing in large networks
To meet the diverse quality-of-service (QoS) requirements of emerging multimedia applications, communication networks should provide end-to-end QoS guarantees. QoS routing is the first step towards this goal. The route computing overhead caused by on-demand calculation of QoS routes, especially in large networks with heavy traffic, is a concern and can cause scalability problems. This paper add...
متن کاملImproving Success Ratio in Multi-Constraint Quality of Service Routing
Multi-constraint quality-of-service routing will become increasingly important as the Internet evolves to support real-time services. It is well known however, that optimum multi-constraint QoS routing is computationally complex, and for this reason various heuristics have been proposed for routing in practical situations. Among these methods, those that use a single mixed metric are the mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014